Search for: All records

Theta and gamma oscillations in the hippocampus have been hypothesized to play a role in the encoding and retrieval of memories. Recently, it was shown that an intrinsic fast gamma mechanism in medial entorhinal cortex can be recruited by optogenetic stimulation at theta frequencies, which can persist with fast excitatory synaptic transmission blocked, suggesting a contribution of interneuronal network gamma (ING). We calibrated the passive and active properties of a 100-neuron model network to capture the range of passive properties and frequency/current relationships of experimentally recorded PV+ neurons in the medial entorhinal cortex (mEC). The strength and probabilities of chemical and electrical synapses were also calibrated using paired recordings, as were the kinetics and short-term depression (STD) of the chemical synapses. Gap junctions that contribute a noticeable fraction of the input resistance were required for synchrony with hyperpolarizing inhibition; these networks exhibited theta-nested high frequency oscillations similar to the putative ING observed experimentally in the optogenetically-driven PV-ChR2 mice. With STD included in the model, the network desynchronized at frequencies above ~200 Hz, so for sufficiently strong drive, fast oscillations were only observed before the peak of the theta. Because hyperpolarizing synapses provide a synchronizing drive that contributes to robustness in the presence of heterogeneity, synchronization decreases as the hyperpolarizing inhibition becomes weaker. In contrast, networks with shunting inhibition required non-physiological levels of gap junctions to synchronize using conduction delays within the measured range. 

According to the most recently revised European design strategy for DEMO breeding blankets, mature concepts have been identified that require a reduced technological extrapolation towards DEMO and will be tested in ITER. In order to optimize and finalize the design of test blanket modules, a number of issues have to be better understood that are related to the magnetohydrodynamic (MHD) interactions of the liquid breeder with the strong magnetic field that confines the fusion plasma. The aim of the present paper is to describe the state of the art of the study of MHD effects coupled with other physical phenomena, such as tritium transport, corrosion and heat transfer. Both numerical and experimental approaches are discussed, as well as future requirements to achieve a reliable prediction of these processes in liquid metal blankets. 

In this work, we study the fascinating notion of output-compressing randomized encodings for Turing Machines, in a shared randomness model. In this model, the encoder and decoder have access to a shared random string, and the efficiency requirement is, the size of the encoding must be independent of the running time and output length of the Turing Machine on the given input, while the length of the shared random string is allowed to grow with the length of the output. We show how to construct output-compressing randomized encodings for Turing machines in the shared randomness model, assuming iO for circuits and any assumption in the set {LWE, DDH, N𝑡ℎ Residuosity}. We then show interesting implications of the above result to basic feasibility questions in the areas of secure multiparty computation (MPC) and indistinguishability obfuscation (iO): 1.Compact MPC for Turing Machines in the Random Oracle Model. In the context of MPC, we consider the following basic feasibility question: does there exist a malicious-secure MPC protocol for Turing Machines whose communication complexity is independent of the running time and output length of the Turing Machine when executed on the combined inputs of all parties? We call such a protocol as a compact MPC protocol. Hubácek and Wichs [HW15] showed via an incompressibility argument, that, even for the restricted setting of circuits, it is impossible to construct a malicious secure two party computation protocol in the plain model where the communication complexity is independent of the output length. In this work, we show how to evade this impossibility by compiling any (non-compact) MPC protocol in the plain model to a compact MPC protocol for Turing Machines in the Random Oracle Model, assuming output-compressing randomized encodings in the shared randomness model. 2. Succinct iO for Turing Machines in the Shared Randomness Model. In all existing constructions of iO for Turing Machines, the size of the obfuscated program grows with a bound on the input length. In this work, we show how to construct an iO scheme for Turing Machines in the shared randomness model where the size of the obfuscated program is independent of a bound on the input length, assuming iO for circuits and any assumption in the set {LWE, DDH, N𝑡ℎ Residuosity}.